Tree series and pattern avoidance in syntax trees
نویسندگان
چکیده
منابع مشابه
Pattern avoidance in binary trees
This paper introduces the notion of pattern avoidance in binary trees. We provide an algorithm for computing the generating function that counts the number of n-leaf binary trees avoiding a given binary tree pattern t. Equipped with this counting mechanism, we study the analogue of Wilf equivalence in which two tree patterns are equivalent if the respective trees that avoid them are equinumerou...
متن کاملPattern Avoidance in Labelled Trees
We discuss a new notion of pattern avoidance motivatedby operad theory: pattern avoidance in planar labelled trees. It is a generalisation of various types of consecutive pattern avoidance studied before: consecutive patterns in words, permutations, colouredpermutations, etc. ThenotionofWilf equivalence for patterns in permutations admits a straightforward generalisation for (sets of) tree patt...
متن کاملNon-Contiguous Pattern Avoidance in Binary Trees
In this paper we consider the enumeration of binary trees avoiding non-contiguous binary tree patterns. We begin by computing closed formulas for the number of trees avoiding a single binary tree pattern with 4 or fewer leaves and compare these results to analogous work for contiguous tree patterns. Next, we give an explicit generating function that counts binary trees avoiding a single non-con...
متن کاملPattern Avoidance in Generalized Non-crossing Trees
Abstract. In this paper, the problem of pattern avoidance in generalized non-crossing trees is studied. The generating functions for generalized non-crossing trees avoiding patterns of length one and two are obtained. Lagrange inversion formula is used to obtain the explicit formulas for some special cases. Bijection is also established between generalized non-crossing trees with special patter...
متن کاملStack Sorting, Trees, and Pattern Avoidance
The subject of pattern avoiding permutations has its roots in computer science, namely in the problem of sorting a permutation through a stack. A formula for the number of permutations of length n that can be sorted by passing it twice through a stack (where the letters on the stack have to be in increasing order) was conjectured by West, and later proved by Zeilberger. Goulden and West found a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 2020
ISSN: 0097-3165
DOI: 10.1016/j.jcta.2020.105285